Vertex-PI Index of Some Nanotubes
Authors
Abstract:
The vertex version of PI index is a molecular structure descriptor which is similar to vertex version of Szeged index. In this paper, we compute the vertex-PI index of TUC4C8(S), TUC4C8(R) and HAC5C7[r, p].
similar resources
Computing Vertex PI Index of Tetrathiafulvalene Dendrimers
General formulas are obtained for the vertex Padmakar-Ivan index (PIv) of tetrathiafulvalene (TTF) dendrimer, whereby TTF units we are employed as branching centers. The PIv index is a Wiener-Szeged-like index developed very recently. This topological index is defined as the summation of all sums of nu(e) and nv(e), over all edges of connected graph G.
full textOn the PI index of some nanotubes
The PI index is a graph invariant defined as the summation of the sums of edges of neu and nev over all the edges of connected graph G, where neu is the number of edges of G lying closer to u than to v and nev is the number of edges of G lying closer to v than to u. The index is very simple to calculate and has disseminating power similar to that of the Wiener and the Szeged indices. The compre...
full textcomputing vertex pi index of tetrathiafulvalene dendrimers
general formulas are obtained for the vertex padmakar-ivan index (piv) of tetrathiafulvalene(ttf) dendrimer, whereby ttf units we are employed as branching centers. the piv index isa wiener-szeged-like index developed very recently. this topological index is defined as thesummation of all sums of nu(e) and nv(e), over all edges of connected graph g.
full textComputation of Co-PI Index of TUC4C8(R) Nanotubes
In this paper, at first we introduce a new index with the name Co-PI index and obtain some properties related this new index. Then we compute this new index for TUC4C8(R) nanotubes.
full textThe vertex PI index and Szeged index of bridge graphs
Recently the vertex Padmakar–Ivan (PI v) index of a graph G was introduced as the sum over all edges e = uv of G of the number of vertices which are not equidistant to the vertices u and v. In this paper the vertex PI index and Szeged index of bridge graphs are determined. Using these formulas, the vertex PI indices and Szeged indices of several graphs are computed.
full textOn vertex balance index set of some graphs
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
full textMy Resources
Journal title
volume 3 issue None
pages 49- 62
publication date 2008-05
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023